A Replacement for Voronoi Diagrams of Near Linear Size
نویسنده
چکیده
For a set P of n points in Rd, we define a new type of space decomposition. The new diagram provides an ε-approximation to the distance function associated with the Voronoi diagram of P , while being of near linear size, for d ≥ 2. This contrasts with the standard Voronoi diagram that has Ω ( ndd/2e ) complexity in the worst case.
منابع مشابه
A Replacement for Voronoi Diagrams of Near Linear Size
A compressed quad tree based replacement for approximate voronoi diagrams with near linear complexity using hierarchial clustering and prioritized point location among balls and with applications for improved approximate nearest neighbour search using point location among equal balls, fat triangulations of proximity diagrams in two and higher dimensions and for fast approximate proximity search.
متن کاملApproximate Voronoi Diagrams
A Voronoi diagram of a point set P ⊆ IR is a partition of space into regions, such that the cell of p ∈ P , is V (p, P ) = { x ∣∣∣‖xp‖ ≤‖xp′‖ for all p′ ∈ P }. Vornoi diagrams are a powerful tool and have numerous applications [Aur91]. One problem with Vornoi diagrams is that their descriptive complexity is O(ndd/2e) in IR, in the worst case. See Figure 1 for an exmaple in three dimensions. It ...
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملForest-Like Abstract Voronoi Diagrams in Linear Time
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. For example, the Voronoi diagram of points in convex position, and the medial axis and constrained Voronoi diagram of a simple polygon are a tree or forest structure...
متن کاملK-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the domain size, and has higher accuracy than other geodesic distance transformations published before. Our appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001